Estimating Pool-depth on Per Query Basis
نویسندگان
چکیده
This paper demonstrates a simple and pragmatic approach for the creation of smaller pools for evaluation of ad hoc retrieval systems. Instead of using an apriori-fixed depth, variable pool-depth based pooling is adopted. The pool for each topic is incrementally built and judged interactively. When no new relevant document is found for a reasonably long run of pool-depths, pooling can be stopped for the topic. Based on available effort and required performance level, the proposed approach can be adjusted for optimality. Experiments on TREC-7, TREC-8 and NTCIR-5 data show its efficacy in substantially reducing poolsize without seriously compromising reliability of evaluation.
منابع مشابه
Evaluation of Allele Frequency Estimation Using Pooled Sequencing Data Simulation
Next-generation sequencing (NGS) technology has provided researchers with opportunities to study the genome in unprecedented detail. In particular, NGS is applied to disease association studies. Unlike genotyping chips, NGS is not limited to a fixed set of SNPs. Prices for NGS are now comparable to the SNP chip, although for large studies the cost can be substantial. Pooling techniques are ofte...
متن کاملتغییرات ذخایر وزنی حوض کربن آلی خاک در ارتباط با تنوع زیستی گیاهی(مطالعه موردی: جنگلهای آمیخته راش گلندرود نور)
Soil organic carbon pool plays an important role in the global C cycle and climate change mitigation. Therefore, improving our understanding of some factors such as plant biodiversity that can affect forest soil C storage is fundamentally important for anticipating changes. This study was carried out in the mixed-beech forests of Glandrood located in Noor using a systematic network of points in...
متن کاملNovel Approach for Query Expansion Using Genetic Algorithm
This paper is focused towards query expansion, which is an important technique for improving retrieval efficiency of an Information Retrieval System. Specifically the paper proposes a novel evolutionary approach for improving efficiency of Pseudo Relevance Feedback (PRF) Based Query Expansion. In this method the candidate terms for query expansion are selected from an initially retrieved list o...
متن کاملEfficient Processing of Exact Top-k Queries over Sorted Lists
The top-k query is employed in a wide range of applications to generate a ranked list of data that have the highest aggregate scores over certain attributes. As the pool of attributes for selection by individual queries may be large, the data are indexed with perattribute sorted lists, and a threshold algorithm is applied on the lists involved in each query. The threshold algorithm executes in ...
متن کاملFraming Image Description as a Ranking Task: Data, Models and Evaluation Metrics
The ability to associate images with natural language sentences that describe what is depicted in them is a hallmark of image understanding, and a prerequisite for applications such as sentence-based image search. In analogy to image search, we propose to frame sentence-based image annotation as the task of ranking a given pool of captions. We introduce a new benchmark collection for sentence-b...
متن کامل